On Bi-gram Graph Attributes

نویسندگان

چکیده

We propose a new approach to text semantic analysis and general corpus using, as termed in this article, "bi-gram graph" representation of corpus. The different attributes derived from graph theory are measured analyzed unique insights or against other graphs. observe vast domain tools algorithms that can be developed on top the representation; creating such proves computationally cheap, much heavy lifting is achieved via basic calculations. Furthermore, we showcase use-cases for bi-gram graphs how scalable it when dealing with large datasets.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Connected Bi-partitions of a Graph

We explore the connected bi-partitions of a graph i.e. spanning subgraphs of a graph which consist of exactly two connected components. We then relate the bi-partitions to the elements of the Moore-Penrose pseudoinverse of the graph Laplacian (L). Moreover, we establish a topological interpretation for the effective resistance metric and the so called Kirchoff index for the graph in terms of th...

متن کامل

Finite groups admitting a connected cubic integral bi-Cayley graph

A graph   is called integral if all eigenvalues of its adjacency matrix  are integers.  Given a subset $S$ of a finite group $G$, the bi-Cayley graph $BCay(G,S)$ is a graph with vertex set $Gtimes{1,2}$ and edge set ${{(x,1),(sx,2)}mid sin S, xin G}$.  In this paper, we classify all finite groups admitting a connected cubic integral bi-Cayley graph.

متن کامل

Effective graph classification based on topological and label attributes

Graph classification is an important data mining task, and various graph kernel methods have been proposed recently for this task. These methods have proven to be effective, but they tend to have high computational overhead. In this paper, we propose an alternative approach to graph classification that is based on feature vectors constructed from different global topological attributes, as well...

متن کامل

Bi-resolving Graph Homomorphisms and Extensions of Bi-closing Codes

Given two graphs G and H, there is a bi-resolving (or bi-covering) graph homomorphism from G to H if and only if their adjacency matrices satisfy certain matrix relations. We investigate the bi-covering extensions of bi-resolving homomorphisms and give several sufficient conditions for a bi-resolving homomorphism to have a bi-covering extension with an irreducible domain. Using these results, w...

متن کامل

Graph-Based N-gram Language Identification on Short Texts

Language identification (LI) is an important task in natural language processing. Several machine learning approaches have been proposed for addressing this problem, but most of them assume relatively long and well written texts. We propose a graph-based N-gram approach for LI called LIGA which targets relatively short and ill-written texts. The results of our experimental study show that LIGA ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer and Information Science

سال: 2021

ISSN: ['1913-8997', '1913-8989']

DOI: https://doi.org/10.5539/cis.v14n3p78